Speculative asynchronous sub-population evolutionary computing

ABSTRACT

A tool computes fitness values for a first generation of a first sub-population of a plurality of sub-populations. A population of candidate solutions for an optimization problem was previously divided into the plurality of sub-populations. The population of candidate solutions was created for an iterative computing process in accordance with an evolutionary algorithm to identify a most fit candidate solution for the optimization problem. The tool determines a speculative ranking of the first generation of the first sub-population prior to the fitness values being computed for all candidate solutions in the first generation of the first sub-population. The tool generates a next generation of the first sub-population based, at least in part, on the speculative ranking prior to completion of computation of the fitness values for the first generation of the first sub-population.

RELATED APPLICATIONS

This application is a Continuation of, and claims the priority benefitof, U.S. application Ser. No. 13/174,441 filed Jun. 30, 2011.

BACKGROUND

Embodiments of the inventive subject matter generally relate to thefield of metaheuristic optimization computing, and, more particularly,to speculating in metaheuristic optimization computing.

Software tools employ metaheuristic optimization algorithms to solveoptimization problems. Examples of metaheuristic optimization algorithmsinclude evolutionary algorithms (e.g., genetic algorithm, differentialevolution), ant colony optimization algorithms, simulated annealingalgorithms, etc.

Evolutionary algorithms use techniques loosely based on Darwinianevolution and biological mechanisms to evolve solutions to tough designproblems. A software tool that implements an evolutionary algorithmstarts with a randomly generated population of solutions, and usessexual recombination, crossover, mutation, and the Darwinian principlesof natural selection to create new, more fit solutions. Evolutionaryalgorithms have been deployed in many aspects of research anddevelopment, and have generated human-competitive solutions to a widerange of problems. Within International Business Machines Corporation(IBM), (SNAP) has been successfully applied to I/O circuit design forPower7/7+, scan-chain routing, the high performance computing (HPC)bidding process, signal integrity for z-series buses, and compiler flagtuning. String-based genetic algorithms are very useful for exploringlarge, complex design spaces where other methods (e.g., linearregressions) fail.

SUMMARY

Embodiments include a method that receives fitness values for a firstgeneration of a first sub-population of a plurality of sub-populations.A population of candidate solutions for an optimization problem waspreviously divided into the plurality of sub-populations. The populationof candidate solutions was created for an iterative computing process inaccordance with an evolutionary algorithm to identify a most fitcandidate solution for the optimization problem. The method determinesthat the first generation of the first sub-population does not satisfy atermination criterion for the iterative computing processing. The methoddetermines that the first generation corresponds to a later iteration ofthe iterative computing process than a second generation of a secondsub-population of the plurality of sub-populations. The methoddetermines that a difference between the first generation and the secondgeneration does not exceed a termination speculation threshold. Themethod generates a third generation of the first sub-populationresponsive to said determining that the difference between the firstgeneration and the second generation does not exceed the terminationspeculation threshold. Generating the third generation of the firstsub-population is based, at least in part, on the fitness values.

BRIEF DESCRIPTION OF THE DRAWINGS

The present embodiments may be better understood, and numerous objects,features, and advantages made apparent to those skilled in the art byreferencing the accompanying drawings.

FIG. 1 illustrates an example system running a software toolimplementing evolutionary computing with termination speculation.

FIG. 2 illustrates an example configuration of two machines in a systemimplementing evolutionary computing with speculation.

FIG. 3 depicts a flowchart of example operations for speculativeevolutionary computing across nodes.

FIG. 4 depicts a flowchart of example operations that continues fromFIG. 3 when a different sub-population satisfies the terminationcriterion.

FIG. 5 depicts a flowchart of example operations involving migrationsthat continues from block 311 of FIG. 3.

FIG. 6 depicts an example flowchart of operations that include migrationspeculation and that continue from block 310 of FIG. 3.

FIG. 7 depicts a flowchart of example operations for applying a fitnessfunction in an evolutionary computing process with speculativeevolution.

FIG. 8 depicts a flowchart of example operations for speculativelyranking candidate solutions.

FIG. 9 depicts an example computer system.

DESCRIPTION OF EMBODIMENT(S)

The description that follows includes example systems, methods,techniques, instruction sequences and computer program products thatembody techniques of the present inventive subject matter. However, itis understood that the described embodiments may be practiced withoutthese specific details. For instance, although examples refer tomachines, embodiments of the inventive subject matter can be implementedin a virtualization environment. For example, sub-populations can beassigned to different virtual machines that can be supported by a singlemachine. As another example, sub-populations can be assigned todifferent cores in a multi-core environment. In other instances,well-known instruction instances, protocols, structures and techniqueshave not been shown in detail in order not to obfuscate the description.

Terminology

Literature about evolutionary computing uses a large variety ofterminology. In some cases, terms are used ambiguously. Geneticalgorithm literature sometimes uses the terms “population” and“generation” ambiguously. In the claims, the terms “population” and“generation” are not used ambiguously. A software tool or computerprogram that implements an evolutionary algorithm to solve anoptimization problem iteratively creates candidate solutions, computesfitness values for the candidate solutions, and evaluates the candidatesolutions to determine whether a next iteration should begin. Thecandidate solutions created at a particular iteration are referred to asa generation of candidate solutions or generation. In the claims, theterm “population” encompasses candidate solutions across generations.Initially, the population includes the initial generation of candidatesolutions. As each generation is created, the new generation becomes apart of the population. The claims will also use the term “iteration.”Iteration is used to refer to a stage in the computing process, insteadof generation. In the claims, generation will be limited to describingthe candidate solutions created at an iteration. The term “process” isoften used to refer to an instantiation of a sequence ofmachine-readable program instructions. The claims will use “evolutionarycomputing process” to refer to the aggregate work performed by computingresource units or nodes for a particular run of a tool or program thatimplements an evolutionary algorithm. In the claims, “evolutionarycomputing process” is not limited to a single instance of executinginstructions. The term “node” or “computing node” is used herein torefer to a computing resource unit. Examples of a node include acomputer, a mobile device, a virtual machine, a core in a multi-coreenvironment, a processor in a multi-processor environment, a group ofcomputers in a cluster, a group of computers in a grid, etc.

Overview

Evolutionary computing evaluates a population of candidate solutions(“individuals”) to obtain fitness values. The fitness values can be usedfor ranking input to a selective process. The selective process informscreation of a next generation of candidate solutions. Generally, theentire population is evaluated based on values from a fitness functionbefore work begins on the next generation. This dependence on the priorgeneration creates an efficiency issue when there is considerablevariation in the time to evaluate an individual. This is often the casewith long simulations running on a pool of (possibly shared)heterogeneous machines. The problem is more acute when hardware failuresand retries are considered. The entire process is held up until the verylast individual of the population has been successfully evaluated.

Preventing a small number of slow-running individuals and/orintermittent failures from stalling the generation and evaluation ofother individuals can reduce the time per generation and increase theefficiency of use of available computing nodes. An evolutionarycomputing technique that uses speculation can prevent this stallingwithout removing individuals from the gene pool, and while preservingrepeatability of evolutions.

A computer program, hardware, and/or tool implementing evolutionarycomputing with multiple nodes can leverage speculation to overcomestalls and/or failures. As an example, a primary node (“evolutionmanager”) can generate an initial generation of a population andsucceeding generations. The evolution manager divides the populationinto sub-populations, and tasks a different one of several nodes toapply a fitness function to the corresponding sub-population. Theseveral nodes compute fitness values for each generation of thesub-populations in parallel, and report results back to the evolutionmanager. Nevertheless, the results are not returned concurrently orsynchronously because the several nodes have different capabilities(e.g., different processors, different component configurations, etc.).Instead of waiting for results for all sub-populations of a generation,the evolution manager can speculate to proceed with generating a nextgeneration of a sub-population independent of other sub-populations. Theevolution manager can implement one or more of three differentspeculation techniques. First, the evolution manager can speculate thatnone of the sub-populations will satisfy the termination criterion forthe evolutionary algorithm. As long as a sub-population is not dependenton migrants from a neighboring sub-population, then the sub-populationcan advance to the next generation. Second, the evolution manager canallow for speculation of migrants. Instead of a sub-population beingstalled by a slower sub-population that will provide the migrants, thefaster sub-population can proceed with speculative migrants. Third, theevolution manager can prod a node that is falling too far behind theother nodes to speculatively rank the individuals of its sub-population.The speculative ranking can be used to create a next generation for theslow/stalled sub-population, and decrease the gap with the othersub-populations.

Illustrations of Some Embodiments

FIG. 1 illustrates an example system running a software toolimplementing evolutionary computing with termination speculation. FIG. 1depicts a system with five machines 101-105 communicatively coupled viaa network 107. FIG. 1 also depicts a dashed line 109 and a dashed linein. The dashed line 109 represents a time T1, and the dashed line inrepresents a time T2. For the illustration of FIG. 1, the machines102-105 are presumed to possess the capability to apply a fitnessfunction to candidate solutions, and the capability to evaluate thefitness values computed from applying the fitness function. Theillustration presumes that the machine 101 possesses the capability tocreate generations of a population. The presumptions are made because awide variety of implementations are possible. Addressing each of thepossible implementations would obfuscate the description of theinventive subject matter. For instance, the capability to evaluatecandidate solutions against a termination criterion could beinstantiated on a single node that manages all other nodes. Thecapability to evaluate candidate solutions could also be instantiated ona few machines tasked with evaluating fitness values created by machines102-105, which are then communicated to the machine 101. An exampleconfiguration of machines is illustrated in FIG. 2.

FIG. 2 illustrates an example configuration of two machines in a systemimplementing evolutionary computing with speculation. In FIG. 2, amachine 201 is communicatively coupled with a machine 203 via a network205. The machine 201 is depicted with several modules, which representfunctionality that can be implemented with any combination of softwareand hardware. The machine 203 is also depicted with a few modules, whichalso represent functionality that can be implemented with anycombination of hardware and software.

The machine 201 hosts the following modules: a migration module 209, acandidate solution generator 211, an evolutionary operations module 213,and a sub-population geography module 215. The machine 201 also hostsconfiguration data 207. The configuration data 207 may be implemented asa single file, multiple files, records in a database, etc. Theconfiguration data 207 may be stored in any of a variety of memoryhardware (e.g., volatile memory, non-volatile memory), and may beobtained locally or remotely.

The configuration data 207 is depicted as including migrationparameter(s), termination criterion(ia), a fitness function, andspeculation constraint(s). Migration parameters are parameters forcontrolling/influencing migration. Examples of the migrationparameter(s) include rate of migration, which neighbor providesmigrants, whether migration is periodic or iterative, an initialiteration to begin migration, etc. Migration parameters can alsointroduce some randomization into migration, and impose a policy of noduplicates. In other words, a migration parameter may forbid a migrantcandidate solution that is a duplicate of another candidate solution inthe destination sub-population. Migration parameters can also define howmigrants are selected (e.g., randomly or based on fitness), whethermigrants are placed in a same or later generation, whether a migrant iscopied or moved, and which candidate solutions are replaced by migrants.A migrant candidate solution can replace a randomly selected candidatesolution or a least fit candidate solution. The termination criterionindicates a condition for stopping an evolutionary computing processfrom proceeding to a next iteration. A fitness function is a functiondefined for an optimization problem to yield one or more fitness valuesfor a candidate solution. A fitness function can be defined for anentire population for an optimization problem, or different fitnessfunctions can be defined for different sub-populations. The fitnessvalue(s) represents a degree of fitness for the optimization problem.The speculation constraint(s) indicates a constraint on performingspeculation. To prevent or reduce incurring additional work fromspeculation, one or more constraints on speculation can be defined.Examples of speculation constraints include distance betweengenerations/iterations, number of speculative migrants, migrant transittime, etc. A speculation constraint can require a minimum number orpercentage of a current generation to be complete before asub-population can advance to a next generation. A speculationconstraint can specify that speculation be restricted until neighboringsub-populations receive their migrants.

The migration module 209 implements operations for migration. Themigration module 209 determines when to begin migration and controlsmigration rate among sub-populations in accordance with the migrationparameter(s).

The candidate solution generator 211 generates candidate solutions ateach iteration of the evolutionary computing process. Initially, thecandidate solution generator 211 can create random candidate solutionsfor an optimization problem. The candidate solution generator 211 canalso create an initial population with one or more seed solutions. Thecandidate solution generator 211 coordinates with the evolutionaryoperations module 213 to generate successive generations. Theevolutionary operations module 213 implements recombination, crossover,mutation, cataclysms, etc.

The sub-population geography module 215 determines or specifiesgeography for an evolutionary computing processing. The geography ofsub-populations informs migration. The geography of sub-populationsindicates which sub-populations neighbor each other. Neighboringsub-populations can source or provide migrants. The sub-populationgeography module 215 can define geography in accordance withconfiguration information (e.g., entered by a user, defined in a file,etc.). The sub-population geography module 215 can also define geographybased on performance capabilities of nodes involved in an evolutionarycomputing process. For example, the sub-population geography module candefine a geography that restricts neighbors to computing nodes havingequivalent computing capabilities.

The machine 203 hosts a fitness function module 217 and an evaluationmodule 219. The fitness function module 217 computes fitness values forcandidate solutions in accordance with a fitness function for anoptimization problem. The evaluation module 219 evaluates the fitnessvalues against one or more termination criteria to determine whether theone or more termination criteria are satisfied.

Implementations of the modules as depicted in FIG. 2 are not necessary.The separate modules are to illustrate examples. For instance, thefunctionalities of the candidate solution generator 211 and evolutionaryoperations module 213 are depicted as separate merely as an exampleillustration. A single functional entity (e.g., software tool,application specific integrated circuit, etc.) can implement thefunctionality of the candidate solutions generator 211 and theevolutionary operations module 213. Indeed, embodiments can partitionand/or unify the functionality represented by the modules 209, 211, 213,215 in any number of ways. The functionality represented by the modulescan also be distributed across nodes or concentrated on a node indifferent ways. For instance, a management node can implement thefunctionality represented by the modules 209, 211, 213, 215, and 217;while one or more other nodes implement the functionality of module 219.As another example, a management node can implement the functionalityrepresented by the modules 209, 211, 213, and 215; a separate set ofnodes can implement the functionality represented by the fitnessfunction module 217; and a different set of nodes can implement thefunctionality of the evaluation module 219.

Returning to FIG. 1, the machine 101 assigns sub-populations A→F of ageneration X to the machines 102-105 as represented by operation 113.Each of the machines 102-105 applies a fitness function for anoptimization problem to the assigned generation X of thesub-populations. Processing of sub-populations D→E and the correspondingmachines are not illustrated because of space constraints. The machine102 computes fitness values for A(X) 115. The notation A(X) signifiesgeneration X of the sub-population A. The machine 102 then evaluates thecomputed fitness values against termination criteria. Afterwards, themachine 102 sends a communication 123 to the machine 101. Thecommunication 123 indicates the fitness value for A(X) and a result ofthe evaluation. The machine 103 performs similar operations on B(X) 117.The machine 103 computes fitness values for B(X) 117. The machine 103then evaluates the computed fitness values against termination criteria.The machine 103 then sends a communication 125 to the machine 101. Thecommunication 125 indicates the fitness value for B(X) and a result ofthe evaluation. For this illustration, both machines 102, 103communicate the fitness values and evaluation results before the time T1represented by the dashed line 109. Also, the evaluations resultsindicate that A(X) and B(X) do not satisfy the termination criteria.

After receiving the communications 123, 125, the machine 101 performsoperations to generate generation X+1 for sub-populations A and B (114).Proceeding with evolutionary operations for the sub-populations A and Bmeans that the machine 101 speculates that generation X of thesub-populations C→F will not satisfy the termination criteria. At sometime soon after T1, the machine 101 sends A(X+1) 131 and B(X+1) 133 tothe machine 102 and the machine 103, respectively. Thus, speculationwith respect to the evaluation results allows the sub-populations A andB to advance and not be hampered by the other sub-populations.

FIG. 1 depicts machine 104 as still processing C(X) 119 at T1. Themachine 107 computes fitness values for F(X) 121, and evaluates thefitness values against the termination criteria. Soon after T1, themachine 107 sends a communication 127, which indicates the fitnessvalues for F(X) 121 and evaluation results, to the machine 101. Afterreceiving the communication 127, the machine 101 performs operations togenerate generation X+1 for sub-population F (129). While the machines102 and 103 respectively operate on A(X+1) and B(X+1), the machine 101sends F(X+1) 135 to the machine 107. During this time, the machine 104is still processing C(X). A variety of reasons can lead to thesub-population C lagging behind the other sub-populations. The machine104 may have less processing power than the other machines. The machine104 may have stalled on a candidate solution. The machine 104 may haveexperienced a failure. Regardless of the reason, speculation does notallow the lagging sub-population to idle the machines 102, 103 and 105.

The machines 102 and 103 finish computing fitness values for A(X+1) andB(X+1) and evaluating those fitness values against termination criteriaprior to time T2 represented by the dashed line 111. The machine 102sends a communication 139, which indicates the fitness values for A(X+1)and evaluation results, to the machine 101 prior to T2. The machine 103also sends a communication 137, which indicates the fitness values forB(X+1) and evaluation results, to the machine 101 prior to T2.Similarly, the machine 107 also finishes computing fitness values forF(X+1) and evaluating those fitness values against termination criteriaprior to time T2. The machine 107 then sends a communication 135, whichindicates the fitness values for F(X+1) and evaluation results, to themachine 101 prior to T2. After receiving the communications 135, 137,and 139, the machine 101 performs evolutionary operations to generategeneration X+2 for sub-populations A, B, and F.

The machine 104 does not finish computing fitness values for C(X) andevaluating those fitness values until after T2. Soon after T2, themachine 104 sends a communication 143 to the machine 101. Thecommunication 143 indicates the fitness values for C(X) and theevaluation results. After receiving the communication 143, the machine101 performs evolutionary operations to generate generation X+1 for thesub-population C, assuming the termination criteria have not beensatisfied by C(X). Instead of the machines 102, 103, and 105 remainingidle until the machine 104 finished computing fitness values andevaluating C(X), the machines 102, 103, 105 were able to advance 1-2generations past generation X. If a sub-population advances to aspeculation threshold, the corresponding machine can be tasked withhelping advance the lagging sub-population. For example, candidatesolutions from the lagging sub-population can be passed to the machinehandling the sub-population that has reached a termination speculationlimit. Or the machine handling the advanced sub-population can be taskedwith a different job while the slower sub-population catches up. Avariety of resource utilization techniques and/or load balancingtechniques can be employed with the inventive subject matter.

For the illustration of FIG. 1, it was assumed that the terminationcriteria were not satisfied by a slower sub-population. In addition,other factors, such as migration, were not considered. As statedearlier, speculation can allow sub-populations to advance even whencandidate solutions migrate between sub-populations that advance atdifferent rates. As stated earlier, a speculative migrant candidatesolution can be generated for a faster sub-population. FIGS. 3-6 depictflowcharts of example operations for speculation in an evolutionarycomputing process that implements migration.

FIG. 3 depicts a flowchart of example operations for speculativeevolutionary computing across nodes. At block 301, a population ofcandidate solutions is divided into sub-populations based on computingnodes. For t candidate solutions and s computing nodes, the populationcan be divided into t/s sub-populations. Division of a population intosub-populations can also be skewed or weighted towards assigning morecandidate solutions to computing nodes with greater capabilities. Atblock 303, each sub-population is assigned to a computing node. At block305, the sub-populations are dispatched to the computing nodes based onthe assignments. For example, a managing node can transmit data thatembodies the sub-populations to the corresponding nodes. In anotherimplementation, a managing node can pass or transmit references to datathat embodiments the sub-populations of candidate solutions. The dashedline from block 305 to block 307 represents a disruption in the flow.The managing node may wait for communications from other nodes involvedin the evolutionary computing process. The managing node may assignitself a sub-population and/or perform administrative tasks (e.g.,monitoring the other nodes, ensure compliance with a resource allocationschedule of the nodes, etc.).

For the implementation illustrated in FIGS. 3-6, a node that generatescandidate solutions also evaluates candidate solutions with fitnessvalues computed by other nodes. Hence, a node that computes fitnessvalues, will communicate the fitness values back to the node thathandles evaluation, which in this case is the managing node thatdispatched the sub-populations. This managing node tracks iterations orprogress of each of the sub-populations through the evolutionarycomputing process. At block 307, fitness values for a generation N of asub-population X are received. At block 309, an indicator is updated toindicate that the sub-population X has arrived at generation N. Forexample, the managing node increments a counter for the sub-populationX.

At block 310, it is determined whether a different sub-population hassatisfied a termination criterion for the evolutionary computingprocess. Since sub-populations are not forced to synchronize at eachgeneration, sub-populations can advance beyond a terminating generation.To prevent or reduce the work on a speculative generation beyond aterminating generation, implementation can check whether the terminationcriterion have been satisfied at different times within an evolutionarycomputing process. In this example implementation, a check is made eachtime a sub-population arrives at a generation. If a sub-population hassatisfied the termination criterion, then control flows to block 401 ofFIG. 4. Otherwise, control flows to block 311.

At block 311, it is determined if generation N of the sub-population Xsatisfies the termination criterion. If the generation N of thesub-population X does not satisfy the termination criterion, thencontrol flows to block 501 of FIG. 5. If the generation N of thesub-population X satisfies the termination criterion, then control flowsto block 313.

If the generation N of the sub-population X was determined to satisfythe termination criterion at block 311, then it is determined if thegeneration N of the sub-population X includes speculative elements atblock 313. A generation of a sub-population may have speculativeelements from a speculatively created migrant candidate solution and/orspeculative ranking of candidate solutions. The details of speculativeranking and speculative migrants will be discussed in FIGS. 6 and 8. Theeffect of speculative ranking and/or a speculative migrant can carrythrough multiple generations. Implementations can track thesespeculative elements with various techniques. As one example,implementations can tag candidate solutions impacted by speculativeranking and/or a speculative migrant. As another example,implementations can maintain a central data structure that indicatesspeculative elements at each generation of each sub-population. If thegeneration N of the sub-population does not include speculativeelements, then control flows to block 315. If the generation N of thesub-population includes speculative elements, then control flows toblock 317.

At block 315, an indicator that the termination criterion is satisfiedby the generation N of the sub-population X is set. For instance a flagor bit is set in a data structure to indicate that at least onecandidate solution in generation N of sub-population X satisfied thetermination criterion.

At block 316, the computing nodes that were not assigned thesub-population X are notified that the termination criterion issatisfied. Notifying the other computing nodes allows nodes working ongenerations beyond the terminating generation to halt working. Fitnessvalues and candidate solutions in generations beyond the terminatinggeneration can be stored for use in other runs of the evolutionarycomputing process for the optimization problem. Nodes processing earliergenerations of sub-populations can proceed with their work until theyarrive at generation N.

If the generation N of sub-population X was determined to includespeculative elements, then the speculative elements are resolved ingeneration N of sub-population X at block 317. If a speculative elementresulted from speculative ranking, then the actual ranking isdetermined. For instance, generation N of the sub-population X mayinclude a candidate solution generated based on speculative ranking ofcandidate solutions in generation N−1 of sub-population X. The actualranking may now be available or additional resources can be dispatchedto expedite obtaining the actual ranking of generation N−1 forsub-population X. If a speculative element resulted from a speculativelycreated migrant, then the speculatively created migrant can be replacedwith the actual migrant. Again, resources can be allocated to expeditereplacement of the speculative migrant with the actual migrant.

At block 319, generation N of the sub-population X with the resolvedspeculative elements is re-evaluated. Resolution of speculative elementsmay change the result of evaluation, although not necessarily. Controlreturns from block 319 to block 311.

From block 311, the example path of operations flows through FIG. 5 andreturns to block 321. At block 321, it is determined if speculativelyadvancing the sub-population X to generation N+1 will exceed thetermination speculation threshold. Although speculating that otherslower sub-populations will not satisfy a termination criterion(“termination speculation”) can increase resource utilization andachieve a result faster, overly aggressive termination speculation canincrease the possibility of expending resources on sub-populationgenerations beyond a terminating generation. The speculation thresholdcan regulate the termination speculation and reduce the risk ofconsuming resources to a point that outweighs the gains from terminationspeculation. If advancing sub-population X to generation N+1 will notexceed the speculation threshold, then control flows to block 501 ofFIG. 5. If the advancing based on termination speculation will exceedthe speculation threshold, then the sub-population X is stalled untilthe threshold is satisfied at block 323. Embodiments are not limited tostalling a faster sub-population, though. Embodiments may utilize othervariables to determine whether to stall a faster sub-population. Aconfidence metric can modify the threshold. For instance, earliergenerations can advance more aggressively based on high confidence thatearly generations will not satisfy the termination criterion. Inaddition, embodiment can redeploy the computing node handling the fastersub-population to help with a slower sub-population or handle adifferent task, perhaps not related to the evolutionary computingprocess.

FIG. 4 depicts a flowchart of example operations that continues fromFIG. 3 when a different sub-population satisfies the terminationcriterion. If it was determined at block 310 of FIG. 3 that a differentsub-population satisfied the termination criterion, then control flowedto block 401 of FIG. 4. At block 401, the generation of the othersub-population that satisfied the termination criterion is determined.Signifying the terminating generation as generation M, if generation Mis equal to generation N, then control flows to block 409. If generationM is earlier than generation N, then control flows to block 405. Ifgeneration M is later than generation N, then control flows to block403.

At block 403, computing nodes are re-allocated for the sub-population X,and any other sub-populations behind generation M. The computing nodesare re-allocated to expedite processing of the slower sub-population.Embodiments, however, are not required to re-allocate computing nodes.Computing nodes can remain idle until slower sub-populations catch up,can resolve speculative elements, be re-allocated to other tasks, etc.Control flows from block 403 to block 501 of FIG. 5.

At block 405, the received fitness values are stored for possible reuse.The candidate solutions may naturally occur in later generations. Inthose cases, the already computed fitness values can be utilized. Inother words, resources can be leveraged for later iterations.Embodiments, however, are not required to reuse fitness values.

At block 407, the sub-population X is rolled back to the generation M.For instance, a managing node can access a store of previous generationsbased on an identifier of the sub-population X, and loading generation Mof the sub-population X.

At block 409, it is determined if generation M of the sub-population Xincludes speculative elements. Coincident with loading the generation Mof the sub-population X, a speculation tracking structure can beaccessed to determine if generation M of sub-population X includesspeculative elements. If the generation M of the sub-population does notinclude speculative elements, then control flows to block 411.Otherwise, control flows to block 415.

At block 415, the speculative elements are resolved in generation M ofsub-population X. If a speculative element resulted from speculativeranking, then actual ranking is determined. For instance, generation Mof the sub-population X may include a candidate solution generated basedon speculative ranking of candidate solutions in generation M−1 ofsub-population X. The actual ranking may now be available or additionalresources can be dispatched to expedite obtaining the actual ranking ofgeneration M−1 for sub-population X. If a speculative element resultedfrom a speculatively created migrant, then the speculatively createdmigrant can be replaced with the actual migrant. A speculative elementmay be result direct from speculation (e.g., an offspring of aspeculative migrant or an offspring with a parent candidate solutionhaving an incorrect speculative ranking). A speculative element may alsoresult indirectly (e.g., a candidate solution removed by at least onegeneration from the generation with speculative ranking or a speculativemigrant).

At block 417, generation M of the sub-population X is re-evaluated.Resolution of speculative elements may change the result of evaluation,although not necessarily. Control flows from block 417 back to block 310of FIG. 3.

At block 411, an indicator that the termination criterion is satisfiedby the generation M of the sub-population X is set. At block 413, thecomputing nodes that were not assigned the sub-population X are notifiedthat the termination criterion is satisfied.

FIG. 5 depicts a flowchart of example operations involving migrationsthat continues from block 311 of FIG. 3. The path of operations arrivesat block 501 after it has been determined that the termination criterionhas not yet been satisfied. The operations depicted in FIG. 5 handlemigration between sub-populations in a speculative environment thatallows for asynchronous sub-population evolution. These operations beginat block 501 for each destination sub-population. If migration does notoccur at generation N of the sub-population X, then the operations arenot performed and control flows to block 513. If the generation N of thesub-population X is supplying at least one candidate solution or migrantto at least one neighboring sub-population, then the operations begin atblock 503.

At block 503, it is determined if the destination or receivingsub-population is at a generation earlier than generation N. If thedestination sub-population is behind the sub-population X, then controlflows to block 509. If the destination sub-population is at the same ora later generation, then control flows to block 505.

At block 509, a migrant(s) is selected and buffered from generation N ofthe sub-population X for the destination sub-population. Embodiments canmaintain a separate memory area, file or record for buffered migrantswaiting for a destination sub-population to arrive at the appropriategeneration. Embodiments can also maintain a reference to a migrant(s)with data that indicates the destination sub-population and appropriategeneration. When the destination sub-population arrives at thegeneration N, then the migrant(s) is inserted and the tracking structureupdated accordingly.

At block 511, a migration tracking structure is updated to indicate thesub-population X, the destination sub-population, and the generation Nfor the buffered migrant(s). Coincident with creating a generation N fora destination sub-population, the migration tracking structure isaccessed to determine whether any migrants are buffered for generation Nof the destination sub-population as generation N of the destinationsub-population is being created or after it has been created. Controlflows from block 511 to block 513.

If the destination sub-population is at generation N or later, then amigrant(s) from generation N of the sub-population X is selected andsent to the destination sub-population. An indication of the generationcan also be communicated. Sending a migrant can involve transmitting themigrant data, transmitting a reference to the migrant data, passing apointer or identifier of the migrant data, etc.

At block 507, the migration tracking structure is updated to indicatethat the migrant(s) was sent to the destination sub-population. Controlflows from block 507 to block 513.

At block 513, it is determined if each destination sub-population hasbeen processed. If not, control returns back to block 501. If so, thencontrol flows back to block 321 of FIG. 3.

FIG. 6 depicts an example flowchart of operations that include migrationspeculation and that continue from block 310 of FIG. 3. Coincident withcreation of generation N+1 for the sub-population X, it is determined ifgeneration N+1 of the sub-population X will receive a migrant(s) atblock 601. If X(N+1) will receive a migrant(s), then control flows toblock 603. If X(N+1) will not receive a migrant, then control flows toblock 602.

At block 602, generation N+1 for the sub-population X is generation anddispatched to the appropriate computing node.

At block 603, operations begin for each sub-population migrant source.

At block 605, it is determined if a migrant(s) is available from thesource. For example, migration tracking data is accessed by thesub-population X. The migration tracking structure will indicate whethera migrant is available (e.g. has been buffered) from the source. If amigrant(s) is not available, then control flows to block 609. If amigrant(s) is available, then control flows to block 607.

At block 607, a migrant(s) is obtained based on migration parameters.For example, the migration parameters can indicate how many migrantswill be provided from a particular source. The migration parameter canindicate that a migrant candidate solution is to be selected randomly.Control flows from block 607 to block 611.

At block 609, an indicator is set that indicates the sub-population Xexpects a migrant(s). For example, the migration tracking data isupdated with an indication that generation N+1 of the sub-population Xexpects a given number of migrants that satisfy migration parameters.Embodiments can also be configured to skip migration if a migrationsource is not ready. Control flows to block 611.

At block 611, the flow returns to block 603 if there is an additionalmigrant source sub-population and continues to block 613 if there is noadditional migrant source sub-population.

At block 613, generation N+1 for the sub-population X is generated withevolutionary operations, and the obtained migrant(s) is inserted intothe generation N+1 of the sub-population X. Inserting of migrantcandidate solutions can vary based on a chosen migration strategy. Themigrant(s) may replace least fit candidate solutions, randomly selectedcandidate solutions, last generated candidate solutions, etc.Embodiments may create X(N+1) with slots for migrant candidatesolutions. For instance, a node may be aware that X(N+1) should have 20candidate solutions and that 4 migrant candidate solutions will beaccepted. Instead of generating 20 candidate solutions and replacingfour of them, the node can generate 16 candidate solutions.

At block 615, it is determined if generation N+1 of the sub-population Xis complete. Some or none of the expected migrants may not have beenavailable. For instance, a source sub-population may not have arrived atgeneration N yet. As another example, a source sub-population mayprocess and send migrants incrementally (e.g., as each completeevaluation). If X(N+1) is not complete, then control flows to block 617.If X(N+1) is complete, then control flows to block 619.

At block 617, one or more speculative migrant(s) are generated tocomplete generation N+1 of the sub-population X. Data is recorded toindicate that the migrants are speculative and/or to indicate that thegeneration N+1 of the sub-population X is impacted by use of aspeculative migrant. Embodiments may mark the speculative migrants totrack the speculative element. Embodiments can create a speculativemigrant by speculatively generating at least part of the generation N ofthe migrant source sub-population, and randomly selecting from thosespeculatively generated candidate solutions. A variable and/or statementconfigured as a migration parameter or a speculation constraint maylimit the number of speculative migrants allowed, may allow use ofspeculative migrants when the migration rate is low, and/or may limitspeculative migrants to one source. For instance, a speculationconstraint can restrict creation and use of speculative migrants tosituations when only one migrant source sub-population is behind themigrant destination sub-population.

At block 619, X(N+1) is dispatched to a computing node.

Although FIG. 6 depicts generating a speculative migrant, embodimentsare not so limited. Some embodiments leave space to receive migrantslater and allow a sub-population to advance to a next generation withless than a full set of candidate solutions. Other embodiments generatea full set of candidate solutions for the generation of thesub-population, and replace some with migrant candidate solutions later.Embodiments that generate candidate solutions to be replaced withmigrant candidate solutions can generate actual candidate solutions,generate placeholder candidate solutions (e.g., unpopulated datastructures), copy already generated candidate solutions and mark thecopies for replacement, etc.

FIG. 7 depicts a flowchart of example operations for applying a fitnessfunction in an evolutionary computing process with speculativeevolution. At a block 701, a generation of a subpopulation of candidatesolutions is received. For example, an evolutionary computing managementnode transmits or passes a third generation of a sub-population A ofcandidate solutions to the node responsible for the sub-population A.

At block 703, operations begin for each candidate solution in thereceived generation. At block 705, it is determined if the candidatesolution is a speculative candidate solution. The candidate solution maybe a speculative candidate solution created to accelerate evolution fora sub-population. For instance, a migrant candidate solution may nothave been available. As another example, the candidate solution may havebeen created from a candidate solution that was speculatively ranked. Ifthe candidate solution is speculative, then control flows to block 707.If the candidate solution is not speculative, then control flows toblock 709.

At block 707, the speculative candidate solution is skipped.Implementations can skip a candidate solution with a variety oftechniques. An implementation can mark the speculative candidatesolution to indicate that it still waits computing a fitness value. Animplementation can skip marking the speculative candidate solution whenothers are marked as completed after the fitness value is computed. Animplementation can store a skipped candidate solution in a differentmemory location, file, record, etc. Control flows from block 707 toblock 711.

At block 709, one or more fitness values are computed for the candidatesolution with a fitness function. The fitness function has beenpreviously defined for the optimization problem. Control flows fromblock 709 to block 711. If there are additional candidate solutions,then control flows back to block 703. Otherwise, control flows to block713.

At block 713, non-speculative candidate solutions that correspond to theskipped speculative candidate solutions are requested. It is possiblethat previously unavailable migrant candidate solutions are available,or actual rankings are possible at this point. If a non-speculativecandidate solution is available, then the speculative candidatesolutions are resolved. For instance, speculative migrants are replacedwith actual migrants. Or candidate solutions spawned from speculativeranking are replaced with a candidate solution based on actual ranking.

At block 715, operations begin for each unmeasured candidate solution.The unmeasured candidate solutions can include skipped speculativecandidate solutions that could not be resolved, and/or candidatesolutions that replaced the speculative candidate solutions. At block717, a fitness value is computed for the unmeasured candidate solutionin accordance with the fitness function. Control flows from block 717 toblock 719. Processing continues to the next unmeasured candidatesolution if it is determined an additional exists at block 719.Otherwise, control flows from block 719 to block 721.

At block 721, the fitness values for the generation of thesub-population are supplied for evaluation against one or moretermination criteria. The fitness values may be passed to anotherprogram or function hosted at the node that computed the fitness values.The fitness value may be stored at a shared resource, and the locationcommunicated to a node performing evaluations. The fitness values may beliterally sent to a node or nodes performing evaluations.

As mentioned above, some candidate solutions may result from speculativeranking. Speculative ranking can be used to accelerate evolution of asub-population that is falling too far behind other sub-populations. Athreshold can be configured to define “too far behind.” For example,speculative ranking can be triggered when a sub-population is ngenerations behind the next slowest node or n generations behind theaverage generation of other nodes. As another example, the evolutionaryprocess can be configured to speculatively ranking when more than 75% ofthe nodes are waiting to continue to a next iteration.

FIG. 8 depicts a flowchart of example operations for speculativelyranking candidate solutions. At block 801, an indication is received toperform fitness speculation to accelerate generation M of asub-population X (“X(M)”). For example, a manager node detects thatcondition(s) for requesting speculatively ranking to accelerateevolution exists for the sub-population X. The managing node thenrequests the node handling sub-population X to speculatively rank thecandidate solutions of X(M).

At block 803, the candidate solutions of X(M) that have computed fitnessvalues are ranked. A node may have already started computing fitnessvalues for X(M) when the instruction to initiate speculative ranking isreceived.

At block 805, rank of the remaining candidate solutions (i.e., those ofthe candidate solutions without fitness values) is speculated withrespect to the other candidate solutions of X(M). An example of aselection technique that uses ranking is tournament selection.Embodiments can speculate as to fitness instead of or in addition torank. Embodiments can predict fitness using median fitness values ofsimilar candidate solutions, the similar candidate solutions being thosewith a small hamming distance from the candidate solution for which theranking is being speculated. Embodiments can also speculate based onhamming distances relative to parent candidate solutions. A tool canspeculate that a fitness value for an offspring candidate solution willbe the same as one of the parents (or parent in mutations) with asmaller hamming distance. Embodiments can also regulate speculation withconfidence in the speculation. Embodiments can base confidence on anumber of similar individuals and a spread of fitness values thereof.Furthermore, embodiments can incorporate an estimated mispredictionpenalty into the confidence. The estimated penalty can be based on rankof similar candidate solutions, the speculative rank, and sub-populationsize. The lower the speculative rank and the higher the selectivepressure (e.g., greater tendency to select most fit candidatesolutions), the lower the misprediction penalty because the candidatesolution may not participate in an evolutionary operation for generatinga next generation. Thus, the speculative ranking would have no impact.Moreover, speculative ranking lowers the impact of mispredicted fitnessvalues. Even though a predicted/speculative fitness value for aconfidence value may be wrong, the speculative rank can still becorrect. If the speculative ranking is validated, then the speculativetag or marking can be removed or ignored despite an incorrectspeculative fitness value.

At block 807, indications of the candidate solutions ranks within X(M)are supplied. For example, data indicating the rankings of X(M) and thatthe rankings are speculative are transmitted to a manager node. Thisallows the manager node to proceed with creating a next generation forthe sub-population X. Candidate solutions of X(M+1) are marked ortracked as spawning from a speculatively ranked generation of candidatesolutions for sub-population X. Embodiments are not required tospeculate rank and supply speculative rank. Embodiments can speculatefitness values, and provide speculative fitness values.

At block 809, the node handling sub-population X resumes computingfitness values for candidate solutions. Although the next generation isbeing created with speculative ranking, an actual ranking with actualfitness values is computed to allow resolution of speculative elementslater.

The depicted flowcharts are for explanatory purposes, and do not limitembodiments of the inventive subject matter. Embodiments can performdifferent operations, fewer operations, additional operations,operations in parallel, operations across different functionalimplementations (e.g., processors, programs, etc.). For instance,embodiments may not skip candidate solutions as depicted in FIG. 7 atblock 707. Embodiments can proceed with computing a fitness value for aspeculative candidate solution. As another example, embodiments may notskip speculative candidate solutions, and compute fitness values for thespeculative candidate solutions. In that case, embodiments can forgo theoperations depicted at blocks 713, 715, 717, and 719. With respect toFIG. 8, embodiments can speculate rank and/or fitness for a candidatesolution in accordance with different techniques. For example, block 809may be performed separately. An implementation can assign a differentnode to continue with computing fitness values for X(M) so that thecurrently responsible node can begin computing fitness values forX(M+1). An implementation may utilize a waiting node to finish computingfitness values for X(M), or to assume responsibility for sub-populationX at least at generation M+1. In another implementation, one or morenodes can be tasked with computing fitness values and validatingspeculated ranking/fitness. With respect to FIG. 6, additionaloperations may be performed if the sub-populations are associated withdifferent fitness functions. An implementation will recompute a fitnessvalue(s) for a migrant candidate solution if the fitness functionsbetween the source and destination are different. The operations acrossFIGS. 3 and 7 can be different in an implementation that evaluatescandidate solutions as their fitness values are computed. When acandidate solution is determined to satisfy a termination criterion,nodes that have advanced to a later generation can be notified to stopworking on speculative generations beyond the terminating generation.

Evolutionary computing tools can also speculate for cataclysms. Anevolutionary computing tool that implements a cataclysm in anevolutionary run can employ speculation with high confidence. A tool canbe configured to perform a mass-extinction type of cataclysm on asub-population if fitness of the sub-population (i.e., fitness of bestcandidate solution) does not improve after y generations. Whileevaluating a generation of a sub-population that would exceed the ygeneration threshold if it fails to make forward progress, the tool canspeculate that fitness of the generation of the sub-population will notimprove after evaluating z candidate solutions. In other words, the toolcan predict that the remaining candidate solutions to be evaluated willnot improve fitness of the generation of the sub-population. Withoutwaiting for evaluation of the current generation of the sub-populationto complete, the tool selects a fittest (or a few fittest) of theevaluated candidate solutions for a next generation of thesub-population, and completes the rest of the next generation of thesub-population with random candidate solutions since the other candidatesolutions of the current generation of the sub-population go extinct.The tool can speculate, with relatively high confidence, that theunevaluated candidate solutions of the current generation of thesub-population will not prevent the cataclysm since so few candidatesolutions survive a cataclysm. The next generation of the sub-populationare marked to indicate a speculative element, and the speculation rolledback if the tool determines that one of the remaining candidatesolutions of the current generation of the sub-population in factprevent the cataclysm.

As will be appreciated by one skilled in the art, aspects of the presentinventive subject matter may be embodied as a system, method or computerprogram product. Accordingly, aspects of the present inventive subjectmatter may take the form of an entirely hardware embodiment, a softwareembodiment (including firmware, resident software, micro-code, etc.) oran embodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present inventive subject matter may takethe form of a computer program product embodied in one or more computerreadable medium(s) having computer readable program code embodiedthereon.

Implementation can vary widely as to task division. The tasks ofgenerating candidate solutions, computing fitness values, and evaluatingfitness values against termination criteria can be configured acrossnodes in a variety of ways or permutations. Use of “manager” or“management” node refers to a node that manages the evolutionarycomputing process across multiple nodes. Although functionality can bedivided in various manners, a managing node will at least be aware ofprogress by each sub-population and when a termination criterion hasbeen satisfied. Embodiments can vary in architecture and/orconfiguration to be tightly centralized at a managing node or moredistributed. In a more distributed architecture, nodes will maintaincommunications to keep each other aware of progress and satisfaction ofthe termination criterion by any sub-population. For example, anembodiment can vertically task each node with all operations for asub-population. Each node can iteratively generate candidate solutions,perform evolutionary operations, compute fitness values, and evaluateeach generation for a sub-population. Until migration impacts ageneration, each node can advance at its own pace and communicateprogress to all other nodes. In addition, each node can be responsiblefor creating speculative migrants and passing those speculative migrantsto neighboring nodes.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent inventive subject matter may be written in any combination ofone or more programming languages, including an object orientedprogramming language such as Java, Smalltalk, C++ or the like andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The program codemay execute entirely on the user's computer, partly on the user'scomputer, as a stand-alone software package, partly on the user'scomputer and partly on a remote computer or entirely on the remotecomputer or server. In the latter scenario, the remote computer may beconnected to the user's computer through any type of network, includinga local area network (LAN) or a wide area network (WAN), or theconnection may be made to an external computer (for example, through theInternet using an Internet Service Provider).

Aspects of the present inventive subject matter are described withreference to flowchart illustrations and/or block diagrams of methods,apparatus (systems) and computer program products according toembodiments of the inventive subject matter. It will be understood thateach block of the flowchart illustrations and/or block diagrams, andcombinations of blocks in the flowchart illustrations and/or blockdiagrams, can be implemented by computer program instructions. Thesecomputer program instructions may be provided to a processor of ageneral purpose computer, special purpose computer, or otherprogrammable data processing apparatus to produce a machine, such thatthe instructions, which execute via the processor of the computer orother programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

FIG. 9 depicts an example computer system. A computer system includes aprocessor unit 901 (possibly including multiple processors, multiplecores, multiple nodes, and/or implementing multi-threading, etc.). Thecomputer system includes memory 907. The memory 907 may be system memory(e.g., one or more of cache, SRAM, DRAM, zero capacitor RAM, TwinTransistor RAM, eDRAM, EDO RAM, DDR RAM, EEPROM, NRAM, RRAM, SONOS,PRAM, etc.) or any one or more of the above already described possiblerealizations of machine-readable media. The computer system alsoincludes a bus 903 (e.g., PCI, ISA, PCI-Express, HyperTransport®,InfiniBand®, NuBus, etc.), a network interface 905 (e.g., an ATMinterface, an Ethernet interface, a Frame Relay interface, SONETinterface, wireless interface, etc.), and a storage device(s) 909 (e.g.,optical storage, magnetic storage, etc.). The system also includes aspeculating evolutionary computing unit 925. The speculatingevolutionary computing unit 925 implements functionality for speculatingtermination, creating a speculative migrant, and/or speculativeranking/fitness. Any one of these functionalities may be partially (orentirely) implemented in hardware and/or on the processing unit 901. Forexample, the functionality may be implemented with an applicationspecific integrated circuit, in logic implemented in the processing unit901, in a co-processor on a peripheral device or card, etc. Further,realizations may include fewer or additional components not illustratedin FIG. 9 (e.g., video cards, audio cards, additional networkinterfaces, peripheral devices, etc.). The processor unit 901, thestorage device(s) 909, and the network interface 905 are coupled to thebus 903. Although illustrated as being coupled to the bus 903, thememory 907 may be coupled to the processor unit 901.

While the embodiments are described with reference to variousimplementations and exploitations, it will be understood that theseembodiments are illustrative and that the scope of the inventive subjectmatter is not limited to them. Embodiments are not limited to thosedescribed herein. A variety of evolutionary algorithms and computingtechniques can be employed for the inventive subject matter. Numerouspermutations of evolutionary algorithms and computational techniques(e.g., virtualization and a particular genetic algorithm, varioushardware configurations with a proprietary evolutionary algorithm, etc.)that exist and that may be developed in the dynamic field ofevolutionary computing and artificial intelligence can leverage theinventive subject matter described herein.

In general, techniques for speculating in evolutionary computing toallow sub-populations to advance asynchronously as described herein maybe implemented with facilities consistent with any hardware system orhardware systems. Many variations, modifications, additions, andimprovements are possible.

Plural instances may be provided for components, operations orstructures described herein as a single instance. Finally, boundariesbetween various components, operations and data stores are somewhatarbitrary, and particular operations are illustrated in the context ofspecific illustrative configurations. Other allocations of functionalityare envisioned and may fall within the scope of the inventive subjectmatter. In general, structures and functionality presented as separatecomponents in the example configurations may be implemented as acombined structure or component. Similarly, structures and functionalitypresented as a single component may be implemented as separatecomponents. These and other variations, modifications, additions, andimprovements may fall within the scope of the inventive subject matter.

What is claimed is:
 1. A computer implemented method for speculativeevolutionary computing, the method comprising: receiving, via one ormore processors, fitness values for a first generation of a firstsub-population of a plurality of sub-populations, wherein a populationof candidate solutions for an optimization problem was previouslydivided into the plurality of sub-populations, wherein the population ofcandidate solutions was created for an iterative computing process inaccordance with an evolutionary algorithm to identify a most fitcandidate solution for the optimization problem; determining, via atleast one of the processors, whether the first generation of the firstsub-population does not satisfy a termination criterion for theiterative computing processing; determining, via at least one of theprocessors, whether the first generation corresponds to a lateriteration of the iterative computing process than a second generation ofa second sub-population of the plurality of sub-populations;determining, via at least one of the processors, whether a differencebetween the first generation and the second generation does not exceed atermination speculation threshold; and generating, via at least one ofthe processors, a third generation of the first sub-populationresponsive to a determination that the difference between the firstgeneration and the second generation does not exceed the terminationspeculation threshold, wherein the generating the third generation ofthe first sub-population based, at least in part, on the fitness values.2. The method of claim 1, wherein said generating the third generationof the first sub-population includes generating the third generation inaccordance with one or more evolutionary computing techniquesimplemented in accordance with the evolutionary algorithm.
 3. The methodof claim 2, wherein the one or more evolutionary computing techniquescomprise at least one of crossover, mutation, and reproduction.
 4. Themethod of claim 1, further comprising dividing, via at least one of theprocessors, the population of candidate solutions for the optimizationproblem into the plurality of sub-populations of candidate solutions andassigning the plurality of sub-populations to computing resources. 5.The method of claim 1, wherein determining whether the first generationcorresponds to the later iteration of the iterative computing processthan the second generation of the second sub-population of the pluralityof sub-populations comprises: accessing generation tracking data basedon a first computing resource identifier and a second computing resourceidentifier, wherein the generation tracking data indicates an iterationof the iterative computing process for each of a plurality of computingresources, wherein the first computing resource identifier identifies afirst computing resource of the plurality of computing resources and thesecond computing resource identifier identifies a second computingresource of the plurality of computing resources, wherein the firstcomputing resource is associated with the first sub-population and thesecond computing resource is associated with the second sub-population;and comparing a first iteration indicated for the first computingresource and a second iteration indicated for the second computingresource identifier.
 6. The method of claim 1, further comprising:determining, via at least one of the processors, that the thirdgeneration of the first sub-population should receive a migrantcandidate solution from a neighboring one of the plurality ofsub-populations; determining, via at least one of the processors, thatthe migrant candidate solution from the neighboring one of the pluralityof sub-populations is not available; creating, via at least one of theprocessors, a speculative migrant candidate solution; and inserting, viaat least one of the processors, the speculative migrant candidatesolution into the third generation of the first sub-population ofcandidate solutions.
 7. The method of claim 6, further comprisingdetermining that a condition for speculatively creating the migrantcandidate solution is satisfied before said creating the speculativemigrant candidate solution.
 8. The method of claim 6, further comprisingtagging the speculative migrant candidate solution to indicatespeculative.